Partial Tree Mixing – a Novel Approach to Phylogenetic Search
نویسندگان
چکیده
Phylogenetic search is an NP-Hard [3] problem. It is however important to the analysis of biological sequences and the testing of evolutionary hypothesis [6]. As such it is necessary to employ heuristic methods. A phylogenetic search begins by using a greedy heuristic to build an initial tree. This initial tree is then improved by the full search. Unfortunately, the greedy nature of the starting trees limits the effectiveness of the full search. Partial Tree Mixing (PTM) addresses this issue through the use of a global representation of partition based tree space [14]. Using this representation PTM is able to quickly begin exploring this space with a global search strategy.
منابع مشابه
Diagnosis of Coronary Artery Disease via a Novel Fuzzy Expert System Optimized by Cuckoo Search
In this paper, we propose a novel fuzzy expert system for detection of Coronary Artery Disease, using cuckoo search algorithm. This system includes three phases: firstly, at the stage of fuzzy system design, a decision tree is used to extract if-then rules which provide the crisp rules required for Coronary Artery Disease detection. Secondly, the fuzzy system is formed by setting the intervals ...
متن کاملIsolation, Identification and Partial Optimization of Novel Xylanolytic Bacterial Isolates from Bhilai-Durg Region, Chhattisgarh, India
Background: Plant biomass and agricultural waste products disposal is a serious problem in agriculture based countries. These wastes, usually rich in xylan can be satisfactorily converted to industrially important and useful products by efficient biotechnological application of potent xylanase producing bacteria which generally have high temperature and pH optima....
متن کاملSingle column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees
MOTIVATION In the maximum parsimony (MP) method, the tree requiring the minimum number of changes (discrepancy) to explain the given set of DNA or amino acid sequences is chosen to represent their evolutionary relationships. To find the MP tree, the branch-and-bound algorithm is normally used. For a partial phylogenetic-tree (one that has a subset of the organisms) the traditional algorithm ass...
متن کاملConsequences of Common Topological Rearrangements for Partition Trees in Phylogenomic Inference
In phylogenomic analysis the collection of trees with identical score (maximum likelihood or parsimony score) may hamper tree search algorithms. Such collections are coined phylogenetic terraces. For sparse supermatrices with a lot of missing data, the number of terraces and the number of trees on the terraces can be very large. If terraces are not taken into account, a lot of computation time ...
متن کاملEffect of Novel Swirl Distributor Plate on Hydrodynamics of Fluidized Bed Gasifier
The main advantage of a fluidized bed is its capability in excellent gas-fuel mixing. However, due to the lacks of gas radial momentum, its lateral mixing of gas-solid is not adequate. Therefore, this research is focused on fluidized bed hydrodynamics enhancement using the modified gas distributor plate design. For getting an optimum fluidized bed hydrodynamics prediction, three different class...
متن کامل